On eigenvalues of Seidel matrices and Haemers’ conjecture

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On eigenvalues of Seidel matrices and Haemers' conjecture

For a graph G, let S(G) be the Seidel matrix of G and θ1(G), . . . , θn(G) be the eigenvalues of S(G). The Seidel energy of G is defined as |θ1(G)| + · · · + |θn(G)|. Willem Haemers conjectured that the Seidel energy of any graph with n vertices is at least 2n − 2, the Seidel energy of the complete graph with n vertices. Motivated by this conjecture, we prove that for any α with 0 < α < 2, |θ1(...

متن کامل

On the eigenvalues of some matrices based on vertex degree

The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.

متن کامل

A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices

In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...

متن کامل

On Eigenvalues of Rectangular Matrices

Given a (k+1)-tuple A,B1, . . . , Bk of (m×n)-matrices withm ≤ n we call the set of all k-tuples of complex numbers {λ1, . . . , λk} such that the linear combination A + λ1B1 + λ2B2 + . . . + λkBk has rank smaller than m the eigenvalue locus of the latter pencil. Motivated primarily by applications to multi-parameter generalizations of the Heine-Stieltjes spectral problem, see [He] and [Vol], w...

متن کامل

On Eigenvalues of Rectangular Matrices

Given a (k+1)-tuple A,B1, . . . , Bk of (m×n)-matrices withm ≤ n we call the set of all k-tuples of complex numbers {λ1, . . . , λk} such that the linear combination A + λ1B1 + λ2B2 + . . . + λkBk has rank smaller than m the eigenvalue locus of the latter pencil. Motivated primarily by applications to multi-parameter generalizations of the Heine-Stieltjes spectral problem, see [He] and [Vol], w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2016

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-016-0248-x